On Rank Modulation Codes
نویسنده
چکیده
We survey rank modulation codes based on a recent result by Mazumdar, Barg and Zemor [MBZ13]. The main results are explicit constructions of rank modulation codes that approach the bounds given by Barg and Mazumdar [BM10].
منابع مشابه
Snake-in-the-Box Codes for Rank Modulation
Motivated by the rank-modulation scheme with applications to flash memory, we consider Gray codes capable of detecting a single error, also known as snake-in-the-box codes. We study two error metrics: Kendall’s τ-metric, which applies to charge-constrained errors, and the `∞-metric, which is useful in the case of limited-magnitude errors. In both cases we construct snake-in-the-box codes with r...
متن کاملOptimal Permutation Codes and the Kendall's $\tau$-Metric
The rank modulation scheme has been proposed for efficient writing and storing data in non-volatile memory storage. Error-correction in the rank modulation scheme is done by considering permutation codes. In this paper we consider codes in the set of all permutations on n elements, Sn, using the Kendall's τ-metric. We will consider either optimal codes such as perfect codes or concepts related ...
متن کاملPerfect Permutation Codes with the Kendall's $\tau$-Metric
The rank modulation scheme has been proposed for efficient writing and storing data in non-volatile memory storage. Error-correction in the rank modulation scheme is done by considering permutation codes. In this paper we consider codes in the set of all permutations on n elements, Sn, using the Kendall’s τ -metric. We prove that there are no perfect single-error-correcting codes in Sn, where n...
متن کاملPerfect permutation codes with the Kendall's τ-metric
The rank modulation scheme has been proposed for efficient writing and storing data in non-volatile memory storage. Error-correction in the rank modulation scheme is done by considering permutation codes. In this paper we consider codes in the set of all permutations on n elements, Sn, using the Kendall’s τ -metric. We prove that there are no perfect single-error-correcting codes in Sn, where n...
متن کاملOn the theory of space-time codes for PSK modulation
The design of space–time codes to achieve full spatial diversity over fading channels has largely been addressed by handcrafting example codes using computer search methods and only for small numbers of antennas. The lack of more general designs is in part due to the fact that the diversity advantage of a code is the minimum rank among the complex baseband differences between modulated codeword...
متن کامل